A sound Interpretation of Leśniewski's Epsilon in Modal Logic KTB
نویسندگان
چکیده
In this paper, we shall show that the following translation \(I^M\) from propositional fragment \(\bf L_1\) of Leśniewski's ontology to modal logic KTB\) is sound: for any formula \(\phi\) and \(\psi\) L_1\), it defined as (M1) \(I^M(\phi \vee \psi) = I^M(\phi) I^M(\psi)\), (M2) \(I^M(\neg \phi) \neg I^M(\phi)\), (M3) \(I^M(\epsilon ab) \Diamond p_a \supset . \wedge \Box p_b .\wedge p_a\), where \(p_a\) \(p_b\) are variables corresponding name \(a\) \(b\), respectively. We give some comments including open problems my conjectures.
منابع مشابه
Data Storage Interpretation of Labeled Modal Logic
We introduce reference structures { a basic mathematical model of a data organization capable to store and utilize information about its addresses. A propositional labeled modal language is used as a speciication and programming language for reference structures; the satissability algorithm for modal language gives a method of building and optimizing reference structures satisfying a given form...
متن کاملA Modal Interpretation of the Logic of Interrogation
We propose a novel interpretation of natural-language questions using a modal predicate logic of knowledge. Our approach brings standard model-theoretic and proof-theoretic techniques from modal logic to bear on questions. Using the former, we show that our interpretation preserves Groenendijk and Stokhof’s answerhood relation, yet allows an extensional interpretation. Using the latter, we get ...
متن کاملA Computational Interpretation of Classical S4 Modal Logic
Plans are programs, and programs are proofs. In particular, multiagent plans are distributed programs, and distributed programs are modal proofs. Inspired by these slogans, I present a new proof system for classical S4 modal logic, based most directly on Wadler’s system for classical propositional logic (2003) and Ghani, de Paiva, and Ritter’s system for intuitionistic modal logic (1998). The s...
متن کاملNormal Forms for Modal Logics Kb and Ktb
Normal forms for propositional modal logics are used to establish the Kripke completeness, the finite model property, and the decidability for modal logics KB and KTB.
متن کاملCircumscription in a Modal Logic
In this paper, we extend circumscription [McCarthy, 80] to a propositional modal logic of knowledge of one agent. Instead of circumscribing a predicate, we circumscribe the knowledge operator "K" in a formula. In order to have a nontrivial circumscription schema, we extend $5 modal logic of knowledge by adding another modality "Val" and a universal quantifier over base sentences (sentences whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Section of Logic
سال: 2021
ISSN: ['2449-836X', '0138-0680']
DOI: https://doi.org/10.18778/0138-0680.2021.25